Narrowing Based Inductive Proof Search
Identifieur interne : 001531 ( Main/Exploration ); précédent : 001530; suivant : 001532Narrowing Based Inductive Proof Search
Auteurs : Claude Kirchner [France] ; Hélène Kirchner [France] ; Fabrice Nahon [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We present in this paper a narrowing-based proof search method for inductive theorems. It has the specificity to be grounded on deduction modulo and to yield a direct translation from a successful proof search derivation to a proof in the sequent calculus. The method is shown to be sound and refutationally correct in a proof theoretical way.
Url:
DOI: 10.1007/978-3-642-37651-1_9
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002E62
- to stream Istex, to step Curation: 002E24
- to stream Istex, to step Checkpoint: 000157
- to stream Main, to step Merge: 001543
- to stream Main, to step Curation: 001531
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Narrowing Based Inductive Proof Search</title><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name></author><author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name></author><author><name sortKey="Nahon, Fabrice" sort="Nahon, Fabrice" uniqKey="Nahon F" first="Fabrice" last="Nahon">Fabrice Nahon</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C45E23D079AF31D02618078F535FBDE2FFAA652B</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-37651-1_9</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-MJ3L5V69-D/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002E62</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002E62</idno><idno type="wicri:Area/Istex/Curation">002E24</idno><idno type="wicri:Area/Istex/Checkpoint">000157</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000157</idno><idno type="wicri:doubleKey">0302-9743:2013:Kirchner C:narrowing:based:inductive</idno><idno type="wicri:Area/Main/Merge">001543</idno><idno type="wicri:Area/Main/Curation">001531</idno><idno type="wicri:Area/Main/Exploration">001531</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Narrowing Based Inductive Proof Search</title><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>INRIA France</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>INRIA France</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Nahon, Fabrice" sort="Nahon, Fabrice" uniqKey="Nahon F" first="Fabrice" last="Nahon">Fabrice Nahon</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>Rectorat Nancy-Metz</wicri:regionArea></affiliation><affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We present in this paper a narrowing-based proof search method for inductive theorems. It has the specificity to be grounded on deduction modulo and to yield a direct translation from a successful proof search derivation to a proof in the sequent calculus. The method is shown to be sound and refutationally correct in a proof theoretical way.</div></front></TEI><affiliations><list><country><li>France</li></country></list><tree><country name="France"><noRegion><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name></noRegion><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name><name sortKey="Nahon, Fabrice" sort="Nahon, Fabrice" uniqKey="Nahon F" first="Fabrice" last="Nahon">Fabrice Nahon</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001531 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001531 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:C45E23D079AF31D02618078F535FBDE2FFAA652B
|texte= Narrowing Based Inductive Proof Search
}}
| This area was generated with Dilib version V0.6.33. |  |